Ingrese una palabra o frase en cualquier idioma 👆
Idioma:
Traducción y análisis de palabras por inteligencia artificial
En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:
- cómo se usa la palabra
- frecuencia de uso
- se utiliza con más frecuencia en el habla oral o escrita
- opciones de traducción
- ejemplos de uso (varias frases con traducción)
- etimología
Qué (quién) es Tree Transformation Language - definición
FORMAL GRAMMAR
Regular tree; Regular tree language
![Example [[derivation tree]] from G<sub>1</sub> in linear (upper left table) and graphical (main picture) notation](https://commons.wikimedia.org/wiki/Special:FilePath/Example derivation tree of a term from a regular tree grammar svg.svg?width=200 "Example [[derivation tree]] from G<sub>1</sub> in linear (upper left table) and graphical (main picture) notation")
Tree Transformation Language
<functional language, rule-based language> (TXL) A hybrid
functional language and rule-based language developed by
J.R. Cordy <cordy@cs.queensu.ca> et al of {Queen's
University}, Canada in 1988. TXL is suitable for performing
source to source analysis and transformation and for rapidly
prototyping new languages and language processors. It uses
structural transformation based on term rewriting.
TXL has been particularly successful in software engineering
tasks such as design recovery, refactoring, and
reengineering. Most recently it has been applied to
artificial intelligence tasks such as recognition of
hand-written mathematics, and to transformation of {structured
documents} in XML.
TXL takes as input an arbitrary context-free grammar in
extended BNF-like notation, and a set of show-by-example
transformation rules to be applied to inputs parsed using the
grammar. TXL supports the notion of agile parsing, the
ability to tailor the grammar to each particular task using
"grammar overrides".
Latest version: FreeTXL 10.3, as of 2003-10-26.
TXL Home (http://txl.ca/).
["TXL: A Rapid Prototyping System for Programming Language
Dialects", J.R. Cordy, C.D.; Halpern and D. Promislow,
Computer Languages, Vol. 16, No. 1, January 1991, pp 97-107 ]
["Source Transformation in Software Engineering using the TXL
Transformation System", J.R. Cordy, T.R. Dean, A.J. Malton and
K.A. Schneider, Journal of Information and Software
Technology, Vol. 44, No. 13, October 2002, pp 827-837 ]
["Recognizing Mathematical Expressions Using Tree
Transformation", R. Zanibbi, D. Blostein and J.R. Cordy, IEEE
Transactions on Pattern Analysis & Machine Intelligence,
Vol. 24, No. 11, November 2002, pp 1455-1467 ]
["Agile Parsing in TXL", T.R. Dean, J.R. Cordy, A.J. Malton
and K.A. Schneider, Journal of Automated Software Engineering,
Vol. 10, No. 4, October 2003, pp 311-336 ]
(2003-11-04)
Transformation (genetics)
PLANNED GENETIC ALTERATION OF A CELL BY UPTAKE OF GENETIC MATERIAL FROM THE ENVIRONMENT
DNA transfer; Bacterial transformation; Transformation, bacterial; Genetic transformation; Cell transformation, viral; Cell transformation, neoplastic; Transformation, genetic; Transformation (bacteria); Cellular transformation; Yeast transformation; Genetic transformation of plants
In molecular biology and genetics, transformation is the genetic alteration of a cell resulting from the direct uptake and incorporation of exogenous genetic material from its surroundings through the cell membrane(s). For transformation to take place, the recipient bacterium must be in a state of competence, which might occur in nature as a time-limited response to environmental conditions such as starvation and cell density, and may also be induced in a laboratory.
Geometric transformation
![[[Isometry]]](https://commons.wikimedia.org/wiki/Special:FilePath/France par rotation 180deg.gif ?width=200 "[[Isometry]]")
![Similarity]]](https://commons.wikimedia.org/wiki/Special:FilePath/France par similitude.gif ?width=200 "Similarity]]")
![[[Affine transformation]]](https://commons.wikimedia.org/wiki/Special:FilePath/France affine (1).gif ?width=200 "[[Affine transformation]]")
![[[Projective transformation]]](https://commons.wikimedia.org/wiki/Special:FilePath/France homographie.gif ?width=200 "[[Projective transformation]]")
![Inversion]]](https://commons.wikimedia.org/wiki/Special:FilePath/France circ.gif ?width=200 "Inversion]]")
![[[Conformal transformation]]](https://commons.wikimedia.org/wiki/Special:FilePath/Fconf.gif ?width=200 "[[Conformal transformation]]")
![Equiareal transformation]]](https://commons.wikimedia.org/wiki/Special:FilePath/France aire.gif ?width=200 "Equiareal transformation]]")
![[[Homeomorphism]]](https://commons.wikimedia.org/wiki/Special:FilePath/France homothetie.gif ?width=200 "[[Homeomorphism]]")
![[[Diffeomorphism]]](https://commons.wikimedia.org/wiki/Special:FilePath/France diff.gif ?width=200 "[[Diffeomorphism]]")
BIJECTION OF A SET HAVING SOME GEOMETRIC STRUCTURE TO ITSELF OR ANOTHER SUCH SET
Discrete transformation; Continuous transformation; Transformation (combinatorics); Transformation (geometry); Geometrical transformation; Partial transformation; Geometric transformations
In mathematics, a geometric transformation is any bijection of a set to itself (or to another such set) with some salient geometrical underpinning. More specifically, it is a function whose domain and range are sets of points — most often both \mathbb{R}^2 or both \mathbb{R}^3 — such that the function is injective so that its inverse exists.
Wikipedia
Regular tree grammar
In theoretical computer science and formal language theory, a regular tree grammar is a formal grammar that describes a set of directed trees, or terms. A regular word grammar can be seen as a special kind of regular tree grammar, describing a set of single-path trees.
